Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks Andreas Krause ∗

Source URL: select.cs.cmu.edu

• Computational complexity theory
• Mathematical optimization
• Operations research
• Submodular set function
• Approximation algorithm
• Wireless sensor network
• Reduction
• Genetic algorithm
• Optimization problem
• Theoretical computer science
• Applied mathematics
• Mathematics

THINK 37 (AND 37A) PROBLEM SET 6 This set is due by noon on Thursday, October 8 in the manilla envelope in Otis Chodosh’s mailbox. Write solutions to four of the following nine problems. As usual, pick problems suitab

Source URL: math.stanford.edu

• Field theory
• Polynomials
• Algebraic numbers
• Equations
• Field extension
• Field
• Cubic function
• Constructible number
• Angle trisection
• Abstract algebra
• Mathematics
• Algebra

MATH 216 PROBLEM SET 8 This set is due by noon on Friday, December 2. Hand in your homework to me by email. Please read all of the problems, and ask me about any statements that you are unsure of, even of the many probl

Source URL: math.stanford.edu

• Terminology
• Business
• Nielsen ratings
• Chess problem
• Marketing

MATH 216 PROBLEM SET 15 This set is due by noon on Friday, April 13. Hand in your homework to me by email. Please read all of the problems, and ask me about any statements that you are unsure of, even of the many proble

Source URL: math.stanford.edu

THINK 37 (AND 37A) PROBLEM SET 2 This set is due by noon on Thursday, October 11 in the manilla envelope in Otis Chodosh’s mailbox. Write solutions to four of the following eight problems. Pick problems suitable to yo

Source URL: math.stanford.edu

• Algebra
• Function
• Summation
• Factorization of polynomials over a finite field and irreducibility tests
• Irreducible polynomial
• Mathematics
• Abstract algebra
• Polynomials

AREC 345: Global Poverty and Economic Development Syllabus (Revised September 4, 2014) Department of Agricultural and Resource Economics University of Maryland Fall 2014

Source URL: pamjakiela.com

• Regents Examinations
• Grade
• Problem set
• Education
• Curricula
• Syllabus

Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin

Source URL: select.cs.cmu.edu

• Operations research
• Spanning tree
• Network flow
• Minimum spanning tree
• Submodular set function
• Flow network
• Wireless sensor network
• Shortest path problem
• Graph theory
• Mathematics
• Theoretical computer science

Better bounds for matchings in the streaming model Michael Kapralov∗ arXiv:1206.2269v2 [cs.DS] 26 JulDecember 6, 2013

Source URL: arxiv.org

• NP-complete problems
• Combinatorial optimization
• Matching
• Degree
• Maximum flow problem
• Graph coloring
• Dominating set
• Mathematics
• Graph theory
• Theoretical computer science

Games and Economic Behavior–264 www.elsevier.com/locate/geb Evolutionary dynamics and backward induction Sergiu Hart Center for Rationality and Interactive Decision Theory, Department of Economics,

Source URL: www.ma.huji.ac.il

• Nash equilibrium
• Subgame
• Backward induction
• Extensive-form game
• Evolutionarily stable strategy
• Trembling hand perfect equilibrium
• Information set
• Best response
• Normal-form game
• Game theory
• Problem solving
• Subgame perfect equilibrium

Chapter 1 Introduction Let f be Boolean function from nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str

Source URL: www.nada.kth.se

• Circuit complexity
• Complexity classes
• Parity function
• ACC0
• Switching lemma
• NC
• Clique problem
• Boolean circuit
• Circuit
• Theoretical computer science
• Computational complexity theory
• Applied mathematics